The Clique

Results: 193



#Item
71NP-complete problems / Matroid theory / Spanning tree / Signed graph / Clique / Graph / Tree / Eulerian path / Pseudoforest / Graph theory / Theoretical computer science / Mathematics

A Local-Search 2-Approximation for 2-Correlation-Clustering? Tom Coleman, James Saunderson, and Anthony Wirth The University of Melbourne Abstract. CorrelationClustering is now an established problem in

Add to Reading List

Source URL: tom.thesnail.org

Language: English - Date: 2015-05-04 03:09:24
72Cabaret / Festival of Britain / Entertainment / UdderBELLY / Underbelly / Jude Kelly / Hayward Gallery / Edinburgh Festival Fringe / La Clique / Edinburgh Festival / London / Southbank Centre

PRESS RELEASE EMBARGOED UNTIL THURSDAY 29 JANUARY, 10AM Underbelly and Southbank Centre announce the return of Udderbelly Festival and London Wonderground at Southbank Centre Underbelly and Southbank Centre are delighted

Add to Reading List

Source URL: www.londonwonderground.co.uk

Language: English - Date: 2015-01-29 06:47:08
73Behavioural sciences / Sociology / Education in the United States / Clique / Peer group / Adolescence / Peer pressure / National Youth Anti-Drug Media Campaign / Conformity / Youth / Social psychology / Behavior

The rewritten part referencing people affected directly (aka paragraph 1)

Add to Reading List

Source URL: www.insna.org

Language: English - Date: 2014-09-27 18:37:22
74Clique / Graph / Vertex / Pseudoforest / Degeneracy / Graph theory / Graph property / Neighbourhood

Understanding the role of technology on the micro level: Biased net theory and social capital

Add to Reading List

Source URL: www.insna.org

Language: English - Date: 2014-09-27 18:32:16
75NP-complete problems / Vertex cover / Kernelization / Feedback vertex set / Clique / Dominating set / Tree decomposition / Graph / Vertex / Graph theory / Theoretical computer science / Mathematics

Noname manuscript No. (will be inserted by the editor) On Tractable Cases of Target Set Selection Andr´

Add to Reading List

Source URL: www.akt.tu-berlin.de

Language: English - Date: 2012-06-07 13:36:43
76Clique / Extremal graph theory / Hypergraph / Degree / Line graph / Graph structure theorem / Graph theory / NP-complete problems / Graph operations

Optim Lett:287–295 DOIs11590ORIGINAL PAPER A generalization of the Motzkin–Straus theorem to hypergraphs

Add to Reading List

Source URL: www.dsi.unive.it

Language: English - Date: 2010-08-27 12:14:22
77Induced path / Matching / Clique / Dominating set / Interval graph / Algebraic topology / Line graph / Path decomposition / Graph theory / Chordal graph / Graph

ALGORITHMIC COMPLEXITY OF FINDING CROSS-CYCLES IN FLAG COMPLEXES MICHAL ADAMASZEK AND JURAJ STACHO Abstract. A cross-cycle in a flag simplicial complex K is an induced subcomplex that is isomorphic to the boundary of a c

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2014-10-30 10:03:20
78NP-complete problems / Graph coloring / Degeneracy / Vertex cover / Edge coloring / Clique / Vertex / Graph / Dense subgraph / Graph theory / Theoretical computer science / Mathematics

The Parameterized Complexity of the Rainbow Subgraph Problem Falk Hüffner? , Christian Komusiewicz?? , Rolf Niedermeier, and Martin Rötzschke Institut für Softwaretechnik und Theoretische Informatik, TU Berlin, German

Add to Reading List

Source URL: fpt.akt.tu-berlin.de

Language: English - Date: 2014-07-31 12:35:33
79Graph operations / Path decomposition / Vertex cover / Feedback vertex set / Clique / Kernelization / Dominating set / Tree decomposition / Vertex / Graph theory / Theoretical computer science / NP-complete problems

Theory of Computing Systems manuscript No. (will be inserted by the editor) Constant Thresholds Can Make Target Set Selection Tractable Morgan Chopin∗ · Andr´

Add to Reading List

Source URL: fpt.akt.tu-berlin.de

Language: English - Date: 2013-09-10 04:14:52
80NP-complete problems / Tree / Clique / Path decomposition / Graph coloring / Graph theory / Theoretical computer science / Mathematics

Bandwidth Approximation of a Restricted Family of Trees Abstract Bandwidth is one of the canonical NP-complete problemsIt is NP-hard to approximate within any constant, even on treesGupta gave a randomized

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2009-12-02 23:05:21
UPDATE